Metaheuristics for Solving a Hybrid Flexible Flowshop Problem with Sequence-Dependent Setup Times
نویسندگان
چکیده
In this paper, we propose three new metaheuristic implementations to address the problem of minimizing the makespan in a hybrid flexible flowshop with sequence-dependent setup times. The first metaheuristic is a genetic algorithm (GA) embedding two new crossover operators, and the second is an ant colony optimization (ACO) algorithm which incorporates a transition rule featuring lookahead information and past information based on archive concepts such as the multiobjective evolutionary computation. The third metaheuristic is a hybridization (HGA) of the GA and the ACO algorithms. Numerical experiments were performed to compare the performance of the proposed algorithms on different benchmarks from the literature. The algorithms are compared with the best algorithms from the literature. The results indicate that our algorithms generate better solutions than those of the known reference
منابع مشابه
Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملA Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملA hybrid heuristic algorithm for the no-wait flowshop problem with sequence-dependent setup times
We consider the NP-hard no-wait flowshop scheduling problem with sequence-dependent setup times to minimize makespan. We propose a hybrid heuristic which combines the iterated greedy process with local search method based on a block swap operator. Experimental results show that the proposed heuristic is comparatively more effective than the existing metaheuristics.
متن کامل